package LeetCode刷题;

/**
 * @program: Java_Study
 * @author: Xiaofan
 * @createTime: 2022-01-19 10:01
 * @description: Functions of this class is
 * 滑动窗口解体：
 * class Solution {
 *     Map<Character, Integer> ori = new HashMap<Character, Integer>();
 *     Map<Character, Integer> cnt = new HashMap<Character, Integer>();
 *
 *     public String minWindow(String s, String t) {
 *         int tLen = t.length();
 *         for (int i = 0; i < tLen; i++) {
 *             char c = t.charAt(i);
 *             ori.put(c, ori.getOrDefault(c, 0) + 1);
 *         }
 *         int l = 0, r = -1;
 *         int len = Integer.MAX_VALUE, ansL = -1, ansR = -1;
 *         int sLen = s.length();
 *         while (r < sLen) {
 *             ++r;
 *             if (r < sLen && ori.containsKey(s.charAt(r))) {
 *                 cnt.put(s.charAt(r), cnt.getOrDefault(s.charAt(r), 0) + 1);
 *             }
 *             while (check() && l <= r) {
 *                 if (r - l + 1 < len) {
 *                     len = r - l + 1;
 *                     ansL = l;
 *                     ansR = l + len;
 *                 }
 *                 if (ori.containsKey(s.charAt(l))) {
 *                     cnt.put(s.charAt(l), cnt.getOrDefault(s.charAt(l), 0) - 1);
 *                 }
 *                 ++l;
 *             }
 *         }
 *         return ansL == -1 ? "" : s.substring(ansL, ansR);
 *     }
 *
 *     public boolean check() {
 *         Iterator iter = ori.entrySet().iterator();
 *         while (iter.hasNext()) {
 *             Map.Entry entry = (Map.Entry) iter.next();
 *             Character key = (Character) entry.getKey();
 *             Integer val = (Integer) entry.getValue();
 *             if (cnt.getOrDefault(key, 0) < val) {
 *                 return false;
 *             }
 *         }
 *         return true;
 *     }
 * }
 **/
public class No最小覆盖字串 {

}